منابع مشابه
On the Average Running Time of Odd-Even Merge Sort
Trus paper is concerned with the average rUDDing time of Batcher's odd-even merge sort when implemented on a collection of processors. We consider the case where n, the size of the input, is an arbitrary multiple of the number p of processors used. We show that Batcher's odd-even merge (for two sorted lists of length n each) can be implemented to run in time O«nlp)(log(2 + p2 In))) on the avera...
متن کاملLinear Time and Branching Time Semantics for Recursion with Merge
We consider two ways of assigning semantics to a class of statements built from a set of atomic actions (the 'alph.abe:'), by means of sequential composition, nondeterministic choice, recursion and merge (arbitmry interleaving). The first is linear time semantics (LT), stated in terms of trace theory; the semantic domain is the collection of all closed sets of finite and inftnite words. The sec...
متن کاملOn average polynomial time
One important reason to consider average case complexity is whether all or at least some signi cant part of NP can be solved e ciently on average for all reasonable distributions Let PP comp be the class of problems which are solvable in average polynomial time for every polynomial time computable input distribution Following the framework of Levin the above question can now be formulated as Is...
متن کاملAverage Time Complexity
We extend Levin's theory of average polynomial time to arbitrary time-bounds in accordance with the following general principles: (1) It essentially agrees with Levin's notion when applied to polynomial time-bounds. (2) If a language L belongs to DTIME(T(n)), for some time-bound T (n), then every distributional problem (L;) is T on the-average. (3) If L does not belong to DTIME(T(n)) almost eve...
متن کاملTime Average in
In this paper we study a model of ferromagnetic material governed by a nonlinear Laudau-Lifschitz equation coupled with Maxwell equations. We prove the existence of weak solutions. Then we prove that all points of the !-limit set of any trajectories are solutions of the stationary model. Furthermore we derive rigourously the quasistatic model by an appropriate time average method.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2003
ISSN: 1571-0661
DOI: 10.1016/s1571-0661(04)80770-9